Cryptanalysis of a Public Key Cryptosystem Proposed at ACISP 2000
نویسندگان
چکیده
At ACISP 2000, Yoo et al proposed a fast public key cryptosystem using matrices over a ring. The authors claim that the security of their system is based on the RSA problem. In this paper we present a heuristic attack that enables us to recover the private key from the public key. In particular, we show that breaking the system can be reduced to finding a short vector in a lattice which can be achieved using the L-lattice reduction algorithm.
منابع مشابه
QTRU: quaternionic version of the NTRU public-key cryptosystems
In this paper we will construct a lattice-based public-key cryptosystem using non-commutative quaternion algebra, and since its lattice does not fully fit within Circular and Convolutional Modular Lattice (CCML), we prove it is arguably more secure than the existing lattice-based cryptosystems such as NTRU. As in NTRU, the proposed public-key cryptosystem relies for its inherent securi...
متن کاملCryptanalysis of Polynominal Authentication and Signature Scheme
Polynomial Authentication and Signature Scheme (PASS) is a new public key authentication and signature scheme proposed by NTRU Cryptosystems Inc. It is based on the hard problems related to constrained polynomial evaluation. In this paper, we break PASS with the proposed parameters. We show how to forge valid authentication transcripts or digital signatures in PASS with knowledge of the public ...
متن کاملA Formal Model for Systematic Design of Key Establishment Protocols
p. 1 The Security of Public Key Cryptosystems Based on Integer Factorization p. 9 A Uniform Approach to Securing Unix Applications Using SESAME p. 24 Integrated Management of Network and Host Based Security Mechanisms p. 36 Covert Distributed Computing Using Java Through Web Spoofing p. 48 Differential Cryptanalysis of a Block Cipher p. 58 On Private-Key Cryptosystems Based on Product Codes p. ...
متن کاملCryptanalysis of a Public Key Cryptosystem Based on the Matrix Combinatorial Problem
In this paper, we present a cryptanalysis of a public key cryptosystem based on the matrix combinatorial problem proposed by Wang and Hu (2010). Using lattice-based methods finding small integer solutions of modular linear equations, we recover the secret key of this cryptosystem for a certain range of parameters. In experiments, for the suggested parameters by Wang and Hu, the secret key can b...
متن کاملCryptanalysis of the MST 3 public key cryptosystem
In this paper we describe a cryptanalysis of MST 3, a public key cryptosystem based on non-commutative groups recently proposed by Lempken, Magliveras, van Trung and Wei.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001